Black-box combinatorial optimization using models with integer-valued minima

A Time-Sensitive System for Black-Box Combinatorial Optimization

Integer and combinatorial optimization

Integer and Combinatorial Optimization

Integer optimization problems are concerned with the efficient allocation of limited resources to meet a desired objective when some of the resources in question can only be divided into discrete parts. In such cases, the divisibility constraints on these resources, which may be people, machines, or other discrete inputs, may restrict the possible alternatives to a finite set. Nevertheless, the...

Integer Valued AR(1) with Geometric Innovations

The classical integer valued first-order autoregressive (INA- R(1)) model has been defined on the basis of Poisson innovations. This model has Poisson marginal distribution and is suitable for modeling equidispersed count data. In this paper, we introduce an modification of the INAR(1) model with geometric innovations (INARG(1)) for model- ing overdispersed count data. We discuss some structu...

Combinatorial Optimization and Integer Programming

Short contents list